A Two-Level ADMM Algorithm for AC OPF With Global Convergence Guarantees
نویسندگان
چکیده
This paper proposes a two-level distributed algorithmic framework for solving the AC optimal power flow (OPF) problem with convergence guarantees. The presence of highly nonconvex constraints in OPF poses significant challenges to algorithms based on alternating direction method multipliers (ADMM). In particular, is not provably guaranteed network optimization problems like OPF. order overcome this difficulty, we propose new reformulation and ADMM algorithm that goes beyond standard ADMM. We establish global iteration complexity proposed under mild assumptions. Extensive numerical experiments over some largest test cases from NESTA PGLib-OPF (up 30 000-bus systems) demonstrate advantages existing variants terms convergence, scalability, robustness. Moreover, appropriate parallel implementation, exhibits fast comparable or even better than state-of-the-art centralized solver.
منابع مشابه
A Cross Entropy based Optimization Algorithm with Global Convergence Guarantees
The cross entropy (CE) method is a model based search method to solve optimization problems where the objective function has minimal structure. The Monte-Carlo version of the CE method employs the naive sample averaging technique which is inefficient, both computationally and space wise. We provide a novel stochastic approximation version of the CE method, where the sample averaging is replaced...
متن کاملAdaptive Firefly Algorithm based OPF for AC/DC Systems
Optimal Power Flow (OPF) is an important operational and planning problem in minimizing the chosen objective functions of the power systems. The recent developments in power electronics have enabled introduction of dc links in the AC power systems with a view of making the operation more flexible, secure and economical. This paper formulates a new OPF to embrace dc link equations and presents a...
متن کاملA quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees
We present a line search algorithm for minimizing nonconvex and/or nonsmooth objective functions. The algorithm is a hybrid between a standard Broyden-Fletcher-Goldfarb-Shanno (BFGS) and an adaptive gradient sampling (GS) method. The BFGS strategy is employed as it typically yields fast convergence to the vicinity of a stationary point, and along with the adaptive GS strategy the algorithm ensu...
متن کاملWeak Convergence of Mann Iterative Algorithm for two Nonexpansive mappings
The mann fixed point algorithm play an importmant role in the approximation of fixed points of nonexpansive operators. In this paper, by considering new conditions, we prove the weak convergence of mann fixed point algorithm, for finding a common fixed point of two nonexpansive mappings in real Hilbert spaces. This results extend the privious results given by Kanzow and Shehu. Finally, we give ...
متن کاملGlobal Convergence of ADMM in Nonconvex Nonsmooth Optimization
In this paper, we analyze the convergence of the alternating direction method of multipliers (ADMM) for minimizing a nonconvex and possibly nonsmooth objective function, φ(x0, . . . , xp, y), subject to coupled linear equality constraints. Our ADMM updates each of the primal variables x0, . . . , xp, y, followed by updating the dual variable. We separate the variable y from xi’s as it has a spe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Power Systems
سال: 2021
ISSN: ['0885-8950', '1558-0679']
DOI: https://doi.org/10.1109/tpwrs.2021.3073116